On the Diophantine Equation x^6+ky^3=z^6+kw^3
نویسندگان
چکیده مقاله:
Given the positive integers m,n, solving the well known symmetric Diophantine equation xm+kyn=zm+kwn, where k is a rational number, is a challenge. By computer calculations, we show that for all integers k from 1 to 500, the Diophantine equation x6+ky3=z6+kw3 has infinitely many nontrivial (y≠w) rational solutions. Clearly, the same result holds for positive integers k whose cube-free part is not greater than 500. We exhibit a collection of (probably infinitely many) rational numbers k for which this Diophantine equation is satisfied. Finally, appealing these observations, we conjecture that the above result is true for all rational numbers k.
منابع مشابه
On the Diophantine Equation
In this paper, we study the Diophantine equation x2 + C = 2yn in positive integers x, y with gcd(x, y) = 1, where n ≥ 3 and C is a positive integer. If C ≡ 1 (mod 4) we give a very sharp bound for prime values of the exponent n; our main tool here is the result on existence of primitive divisors in Lehmer sequence due Bilu, Hanrot and Voutier. When C 6≡ 1 (mod 4) we explain how the equation can...
متن کاملOn the Diophantine Equation
= c for some integers a, b, c with ab 6= 0, has only finitely many integer solutions. Stoll & Tichy proved more generally that if a, b, c ∈ Q and ab 6= 0, then for m > n ≥ 3, the above equation has only finitely many integral solutions x, y. Independently, Rakaczki established a more precise finiteness result on this binomial equation and extended this result to more general equations (see Acta...
متن کاملOn the Diophantine Equation
If a, b and n are positive integers with b ≥ a and n ≥ 3, then the equation of the title possesses at most one solution in positive integers x and y, with the possible exceptions of (a, b, n) satisfying b = a + 1, 2 ≤ a ≤ min{0.3n, 83} and 17 ≤ n ≤ 347. The proof of this result relies on a variety of diophantine approximation techniques including those of rational approximation to hypergeometri...
متن کاملOn the Diophantine Equation
In this remark, we use some properties of simple continued fractions of quadratic irrational numbers to prove that the equation x3 − 1 x− 1 = y − 1 y − 1 , x, y, n ∈ N, x > 1, y > 1, n > 3, 2 ∤ n has only the solutions (x, y, n) = (5, 2, 5) and (90, 2, 13). For any positive integer N with N > 2, let s(N) denote the number of solutions (x,m) of the equation (1) N = x − 1 x− 1 , x,m ∈ N, x ≥ 2, m...
متن کاملOn the Diophantine Equation
In this paper we study the equation x+7 = y, in integers x, y, m with m ≥ 3, using a Frey curve and Ribet’s level lowering theorem. We adapt some ideas of Kraus to show that there are no solutions to the equation with m composite and m > 15, and none with m prime and 11 ≤ m < 10.
متن کاملOn the Exponential Diophantine Equation
Let a, b, c be fixed positive integers satisfying a2 + ab + b2 = c with gcd(a, b) = 1. We show that the Diophantine equation a2x+axby+b2y = cz has only the positive integer solution (x, y, z) = (1, 1, 1) under some conditions. The proof is based on elementary methods and Cohn’s ones concerning the Diophantine equation x2 + C = yn. Mathematics Subject Classification: 11D61
متن کاملOn Pillai’s Diophantine equation
Let A, B, a, b and c be fixed nonzero integers. We prove several results on the number of solutions to Pillai’s Diophantine equation Aa −Bby = c in positive unknown integers x and y.
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ذخیره در منابع من قبلا به منابع من ذحیره شده{@ msg_add @}
عنوان ژورنال
دوره 15 شماره 1
صفحات 15- 21
تاریخ انتشار 2020-04
با دنبال کردن یک ژورنال هنگامی که شماره جدید این ژورنال منتشر می شود به شما از طریق ایمیل اطلاع داده می شود.
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023